Pii: S0168-9274(98)00131-7
نویسندگان
چکیده
In the present paper suboptimal boundary control strategies for the time-dependent, incompressible flow over the backward-facing step are considered. The objective consists in the reduction of the recirculation bubble of the flow behind the step. Several cost functionals are suggested and a frame for the derivation of the optimality systems for a general class of cost functionals is presented. Numerical examples are given. 1999 Elsevier Science B.V. and IMACS. All rights reserved.
منابع مشابه
Pii: S0168-9274(01)00131-3
We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of x onto a hyperplane which minimizes its distance to the solution x∗. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers. 2001 IMACS. Publi...
متن کاملPii: S0168-9274(99)00131-2
We study numerical integrators that contract phase space volume even when the ODE does so at an arbitrarily small rate. This is done by a splitting into two-dimensional contractive systems. We prove a sufficient condition for Runge–Kutta methods to have the appropriate contraction property for these two-dimensional systems; the midpoint rule is an example. 2000 IMACS. Published by Elsevier Sc...
متن کاملPii: S0168-9274(98)00087-7
In the present paper we are concerned with boundary-value problems (BVP) for the generalized Emden–Fowler equations. Asymptotic expansions of the solution are obtained near the endpoints. We use a finite-difference scheme to approximate the solution and the convergence is accelerated by means of extrapolation methods. A variable substitution is introduced to diminish the effect of the singulari...
متن کاملPii: S0168-9274(98)00101-9
Primal-dual affine-scaling methods have recently been extended from linear programming to semidefinite programming. We show how to analyze these methods in the framework of potential reduction algorithms. The analysis suggests implementable variants of the methods as 'long step predictor-corrector' algorithms, where the step length is determined by the potential function. A numerical comparison...
متن کاملPii: S0168-9274(98)00108-1
A new family of iterative block methods, the family of block EN-like methods, is introduced. Efficient versions are presented and computational complexity, memory requirements and convergence properties are investigated. Finally, leading evidence of the potential of the new family is demonstrated via a comparison of numerical results and performance to other block methods. 1999 Elsevier Scien...
متن کامل